Riesz decompositions in Markov process theory
نویسندگان
چکیده
منابع مشابه
Path Decompositions for Markov Chains
We present two path decompositions of Markov chains (with general state space) by means of harmonic functions, which are dual to each other. They can be seen as a generalization of Williams' decomposition of a Brownian motion with drift. The results may be illustrated by a multitude of examples, but we confine ourselves to different types of random walks and the Pólya urn. 1. Introduction and m...
متن کاملOn Decompositions in Homotopy Theory
We first describe Krull-Schmidt theorems decomposing H spaces and simply-connected co-H spaces into atomic factors in the category of pointed nilpotent p-complete spaces of finite type. We use this to construct a 1-1 correspondence between homotopy types of atomic H spaces and homotopy types of atomic co-H spaces, and construct a split fibration which connects them and illuminates the decomposi...
متن کاملApproaches to macro decompositions of large Markov decision process planning problems
Mobile robot navigation tasks are subject to motion stochasticity arising from the robot’s local controllers, which casts the navigational task into a Markov decision process framework. The MDP may, however, be intractably large; in this work we consider the prioritized package delivery problem which yields an exponentially large state space. We demonstrate that the bulk of this state space is ...
متن کاملPredictive PAC Learning and Process Decompositions
We informally call a stochastic process learnable if it admits a generalization error approaching zero in probability for any concept class with finite VC-dimension (IID processes are the simplest example). A mixture of learnable processes need not be learnable itself, and certainly its generalization error need not decay at the same rate. In this paper, we argue that it is natural in predictiv...
متن کاملMarkov Regenerative Process in Sharpe
Markov regenerative processes (MRGPs) constitute a more general class of stochastic processes than traditional Markov processes. Markovian dependency, the first-order dependency, is the simplest and most important dependency in stochastic processes. Past history of a Markov chain is summarized in the current state and the behavior of the system thereafter only depends on the current state. Sojo...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Transactions of the American Mathematical Society
سال: 1984
ISSN: 0002-9947
DOI: 10.1090/s0002-9947-1984-0748833-1